home *** CD-ROM | disk | FTP | other *** search
-
- Usage: pfactor n1 [n2 [n3 [...] ] ]
-
- Prints prime factorisations of given numbers n1, n2 etc.
- Works from CLI only, and is limited to integers of size <= 2^32-1,
- ie. for n <= 4294967295 (which is actually prime).
-
- Factorisations are done almost instantaneously.
- Source available free on request.
-
- - Martin Scott (email: mws@castle.ed.ac.uk)
-